基于多体动力学仿真的冰箱助吸器优化设计

某款冰箱在关门过程中,门体在多个小角度处出现悬停的现象,影响用户的体验。针对这一问题,基于多体动力学仿真对冰箱助吸器进行了优化设计。将助吸器变形量、刚度、有效力臂接触位置点至铰链轴心连线长度,以及这一连线与接触位置法向夹角作为关键因子,研究关键因子与设计目标之间的关系,进行助吸器的结构设计与性能评估。在此基础上,基于多体动力学仿真,实现助吸器的优化,并形成最终设计方案。基于多体动力学仿真进行优化设计,可以缩短开发周期,提高设计效率,具有较高的实用价值。     

Application of Vis–NIR hyperspectral imaging in classification between fresh and frozen-thawed pork Longissimus Dorsi muscles

Fresh and frozen-thawed (F-T) pork meats were classified by Vis–NIR hyperspectral imaging. Eight optimal wavelengths (624, 673, 460, 588, 583, 448, 552 and 609 nm) were selected by successive projections algorithm (SPA). The first three principal components (PCs) obtained by principal component analysis (PCA) accounted for over 99.98% of variance. Gray-level-gradient co-occurrence matrix (GLGCM) was applied to extract 45 textural features from the PC images. The correct classification rate (CCR) was employed to evaluate the performance of the partial least squares-discriminate analysis (PLS-DA) models, by using (A) the reflected spectra at full wavelengths and (B) those at the optimal wavelengths, (C) the extracted textures based on the PC images, and (D) the fused variables combining spectra at the optimal wavelengths and textures. The results showed that the best CCR of 97.73% was achieved by applying (D), confirming the high potential of textures for fresh and F-T meat discrimination.     

一种军棋机器博弈的多棋子协同博弈方法

针对在军棋博弈不完全信息对弈中，面对棋子不同价值、不同位置、不同搭配所产生的不同棋力，传统的单子意图搜索算法，不能满足棋子之间的协同性与沟通性，同时也缺乏对敌方的引诱与欺骗等高级对抗能力。本文提出一种结合UCT搜索策略的高价值棋子博弈方法，实现高价值棋子协同博弈的策略。实战经验表明:高价值多棋子军棋协同博弈策略优于单棋子军棋博弈策略。     

因素空间理论下基点分类算法研究

目前，基于因素空间理论的背景基提取算法计算过程复杂，初始化必须依赖各因素极值，基点数量提取冗余等原因，未能在应用中取得很好效果。为此，结合内点判别法和知识可继承、可扩展的思想，提出一种计算简单、初始化独立、基点数量小的改进的背景基提取算法。然后，利用改进的背景基提取算法构造出一种全新的数据分类算法-基点分类算法，基点分类算法以提取每一类样本的背景基为预测模型，再通过新定义的λ-背景基，优化预测模型。数值实验表明:基点分类算法原理简单、构造难度小、分类模型泛化能力强，预测能力准确率高，同时严格的模型限定区域又能为识别新类别提供新方法。     

基于ＰＩＤ控制算法的直流微网容错控制方法研究

构建直流微网容错控制对象模型，调节直流微电网的输出回路参数；以输出功率、直流微网的 参考电压、弱电网下系统惯性响应特征等为约束参量，构建直流微网容错控制目标函数，在不同电网强度下 进行直流微网容错控制的参数自整定性调节，采用无功环比例积分控制方法进行直流微网容错寻优分析， 建立模糊 ＰＩＤ控制模型，采用变结构的模糊 ＰＩＤ控制方法进行直流微网容错控制过程中的自适应加权学习 和误差反馈调节，实现直流微网容错控制改进设计。仿真结果表明，采用该方法进行直流微网控制的容错 性能较好，输出稳定性较强，具有较好的直流微网输出增益。     

基于改进NSGA-Ⅱ算法的乙烯裂解炉操作优化

现有的乙烯裂解炉优化通常只针对两个目标函数即产物乙烯和丙烯的收率，并且采用遗传算法的收敛效果一般，故提出一种基于改进NSGA-Ⅱ算法来研究一个多目标运行的解决方案，以此来解决乙烯裂解炉的固定周期操作优化问题，即在增大产物乙烯和丙烯收率的同时减少原料以及蒸汽流量来提高整体运行状况。把具体问题量化为数学模型，分析了原料气烃比、原料流量、出口温度对乙烯和丙烯收率的影响。实验结果表明，相较于原有操作条件，提出的优化方案具有良好的可行性。     

一种改进的新三步搜索算法

在对三步法工作原理进行研究的基础上提出了新三步搜索算法（NITSS）。该方法充分利用视频序列运动矢量概率分布上的中心偏置特性．在三步搜索算法的基础上引入了十字型分布的4个点构成搜索点群。实验结果表明。新三步搜索算法解决了三步法的小运动估计效果较差问题．提高了搜索精度，保持了三步法的高效率。     

An effective coding approach for multiobjective integrated resource selection and operation sequences problem

In this paper, we consider an integrated Resource Selection and Operation Sequences (iRS/OS) problem in Intelligent Manufacturing System (IMS). Several kinds of objectives are taken into account, in which the makespan for orders should be minimized; workloads among machine tools should be balanced; the total transition times between machines in a local plant should also be minimized. To solve this multiobjective iRS/OS model, a new two vectors-based coding approach has been proposed to improve the efficiency by designing a chromosome containing two kinds of information, i.e., operation sequences and machine selection. Using such kind of chromosome, we adapt multistage operation-based Genetic Algorithm (moGA) to find the Pareto optimal solutions. Moreover a special technique called left-shift hillclimber has been used as one kind of local search to improve the efficiency of our algorithm. Finally, the experimental results of several iRS/OS problems indicate that our proposed approach can obtain best solutions. Further more comparing with previous approaches, moGA performs better for finding Pareto solutions. Received: May 2005/Accepted: December 2005     

Service composition for generic service graphs

Service composition is a promising approach to multimedia service provisioning, due to its ability to dynamically produce new multimedia content, and to customize the content for individual client devices. Previous research work has addressed various aspects of service composition such as composibility, QoS-awareness, and load balancing. However, most of the work has focused on applications where data flow from a single source is processed by intermediate services and then delivered to a single destination. In this paper, we address the service composition problem for multimedia services that can be modeled as directed acyclic graphs (DAGs). We formally define the problem and prove its NP hardness. We also design a heuristic algorithm to solve the problem. Our simulation results show that the algorithm is effective at finding low-cost composition solutions, and can trade off computation overhead for better results. When compared with a hop-by-hop approach for service composition, our algorithm can find composition solutions that aress 10% smaller in cost, even when the hop-by-hop approach uses exhaustive searches.